Implementation of a unimodularity test
نویسندگان
چکیده
منابع مشابه
Implementation of a Unimodularity Test
This paper describes implementation and computational results of a polynomial test of total unimodularity. The test is a simpli ed version of a prior method. The program also decides two related unimodularity properties. The software is available free of charge in source code form under the Boost Software License.
متن کاملA Farewell to Unimodularity
We interpret the unimodularity condition in almost commutative geometries as central extensions of spin lifts. In Connes’ formulation of the standard model this interpretation allows to compute the hypercharges of the fermions. PACS-92: 11.15 Gauge field theories MSC-91: 81T13 Yang-Mills and other gauge theories
متن کاملRemarks on unimodularity
We clarify and correct some statements and results in the literature concerning unimodularity in the sense of Hrushovski [7], and measurability in the sense of Macpherson and Steinhorn [8], pointing out in particular that the two notions coincide for strongly minimal structures and that another property from [7] is strictly weaker, as well as “completing” Elwes’ proof [5] that measurability imp...
متن کاملconstruction and validation of a computerized adaptive translation test (a receptive based study)
آزمون انطباقی رایانه ای (cat) روشی نوین برای سنجش سطح علمی دانش آموزان می باشد. در حقیقت آزمون های رایانه ای با سرعت بالایی به سمت و سوی جایگزین عملی برای آزمون های کاغذی می روند (کینگزبری، هاوسر، 1993). مقاله حاضر به دنبال آزمون انطباقی رایانه ای برای ترجمه می باشد. بدین منظور دو پرسشنامه مشتمل بر 55 تست ترجمه میان 102 آزمودنی و 10 مدرس زبان انگلیسی پخش گردید. پرسشنامه اول میان 102 دانشجوی س...
Discrete Convexity and Unimodularity. I
In this paper we develop a theory of convexity for the lattice of integer points Z, which we call theory of discrete convexity. What subsets X ⊂ Z could be called ”convex”? One property seems indisputable: X should coincide with the set of all integer points of its convex hull co(X). We call such sets pseudo-convex. The resulting class PC of all pseudo-convex sets is stable under intersection b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming Computation
سال: 2012
ISSN: 1867-2949,1867-2957
DOI: 10.1007/s12532-012-0048-x